Employee workload balancing by graph partitioning
نویسندگان
چکیده
منابع مشابه
Workload-aware Streaming Graph Partitioning
Partitioning large graphs, in order to balance storage and processing costs across multiple physical machines, is becoming increasingly necessary as the typical scale of graph data continues to increase. A partitioning, however, may introduce query processing latency due to inter-partition communication overhead, especially if the query workload exhibits skew, frequently traversing a limited su...
متن کاملEmployee positioning and workload allocation
Assigning tasks to employees is a difficult task. Errors committed in such assignments can have far-reaching consequences, such as reduced efficiency due to absenteeism, lack of job satisfaction, formal grievances, and generally deteriorating labor relations. This paper approaches the problem from a spatial point of view. First, the employees and the relevant tasks are mapped in a skill space. ...
متن کاملBalancing Nursing Workload by Constraint Programming
Nursing workload in hospitals has an impact on the quality of care and on job satisfaction. Understandably there has been much recent research on improving the staffing and nurse-patient assignment decisions in increasingly realistic settings. On a version of the nursepatient assignment problem given a fixed staffing of neonatal intensive care units, constraint programming (CP) was shown to per...
متن کاملApplying graph partitioning methods in measurement-based dynamic load balancing
Load imbalance leads to an increasing waste of resources as an application is scaled to more and more processors. Achieving the best parallel efficiency for a program requires optimal load balancing which is a NP-hard problem. However, finding near-optimal solutions to this problem for complex computational science and engineering applications is becoming increasingly important. Charm++, a migr...
متن کاملDistributed CSPs by graph partitioning
Nowadays, many real problems in artificial intelligence can be modelled as constraint satisfaction problems (CSPs). A general CSP is known to be NP-complete. Nevertheless, distributed models may reduce the exponential complexity by partitioning the problem into a set of subproblems. In this paper, we present a preprocess technique to break a single large problem into a set of smaller loosely co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.02.014